A comparative study of survival models for breast cancer prognostication based on microarray data: does a single gene beat them all?

Motivation: Survival prediction of breast cancer (BC) patients independently of treatment, also known as prognostication, is a complex task since clinically similar breast tumors, in addition to be molecularly heterogeneous, may exhibit different clinical outcomes. In recent years, the analysis of gene expression profiles by means of sophisticated data mining tools emerged as a promising technology to bring additional insights into BC biology and to improve the quality of prognostication. The aim of this work is to assess quantitatively the accuracy of prediction obtained with state-of-the-art data analysis techniques for BC microarray data through an independent and thorough framework

Threshold cryptography based on asmuth-bloom secret sharing

In this paper, we investigate how threshold cryptography can be conducted with the Asmuth-Bloom secret sharing scheme and present two novel function sharing schemes, one for the RSA signature and the other for the ElGamal decryption functions, based on the Asmuth-Bloom scheme. To the best of our knowledge, these are the first threshold cryptosystems realized using the Asmuth-Bloom secret sharing. The proposed schemes compare favorably to the earlier function sharing schemes in performance as well as in certain theoretical aspects. © Springer-Verlag Berlin Heidelberg 2006

Quantum protocols for anonymous voting and surveying

We describe quantum protocols for voting and surveying. A key feature of our schemes is the use of entangled states to ensure that the votes are anonymous and to allow the votes to be tallied. The entanglement is distributed over separated sites; the physical inaccessibility of any one site is sufficient to guarantee the anonymity of the votes. The security of these protocols with respect to various kinds of attack is discussed. We also discuss classical schemes and show that our quantum voting protocol represents a N-fold reduction in computational complexity, where N is the number of voters.Comment: 8 pages. V2 includes the modifications made for the published versio

Fair and Sound Secret Sharing from Homomorphic Time-Lock Puzzles

Achieving fairness and soundness in non-simultaneous rational secret sharing schemes has proved to be challenging. On the one hand, soundness can be ensured by providing side information related to the secret as a check, but on the other, this can be used by deviant players to compromise fairness. To overcome this, the idea of incorporating a time delay was suggested in the literature: in particular, time-delay encryption based on memory-bound functions has been put forth as a solution. In this paper, we propose a different approach to achieve such delay, namely using homomorphic time-lock puzzles (HTLPs), introduced at CRYPTO 2019, and construct a fair and sound rational secret sharing scheme in the non-simultaneous setting from HTLPs. HTLPs are used to embed sub-shares of the secret for a predetermined time. This allows to restore fairness of the secret reconstruction phase, despite players having access to information related to the secret which is required to ensure soundness of the scheme. Key to our construction is the fact that the time-lock puzzles are homomorphic so that players can compactly evaluate sub-shares. Without this efficiency improvement, players would have to independently solve each puzzle sent from the other players to obtain a share of the secret, which would be computationally inefficient. We argue that achieving both fairness and soundness in a non-simultaneous scheme using a time delay based on CPU-bound functions rather than memory-bound functions is more cost effective and realistic in relation to the implementation of the construction

Practical threshold signatures with linear secret sharing schemes

Function sharing deals with the problem of distribution of the computation of a function (such as decryption or signature) among several parties. The necessary values for the computation are distributed to the participating parties using a secret sharing scheme (SSS). Several function sharing schemes have been proposed in the literature, with most of them using Shamir secret sharing as the underlying SSS. In this paper, we investigate how threshold cryptography can be conducted with any linear secret sharing scheme and present a function sharing scheme for the RSA cryptosystem. The challenge is that constructing the secret in a linear SSS requires the solution of a linear system, which normally involves computing inverses, while computing an inverse modulo φ(N) cannot be tolerated in a threshold RSA system in any way. The threshold RSA scheme we propose is a generalization of Shoup's Shamir-based scheme. It is similarly robust and provably secure under the static adversary model. At the end of the paper, we show how this scheme can be extended to other public key cryptosystems and give an example on the Paillier cryptosystem. © 2009 Springer Berlin Heidelberg

A kilobit hidden SNFS discrete logarithm computation

We perform a special number field sieve discrete logarithm computation in a 1024-bit prime field. To our knowledge, this is the first kilobit-sized discrete logarithm computation ever reported for prime fields. This computation took a little over two months of calendar time on an academic cluster using the open-source CADO-NFS software. Our chosen prime $p$ looks random, and $p--1$ has a 160-bit prime factor, in line with recommended parameters for the Digital Signature Algorithm. However, our p has been trapdoored in such a way that the special number field sieve can be used to compute discrete logarithms in $\mathbb{F}\_p^*$ , yet detecting that p has this trapdoor seems out of reach. Twenty-five years ago, there was considerable controversy around the possibility of back-doored parameters for DSA. Our computations show that trapdoored primes are entirely feasible with current computing technology. We also describe special number field sieve discrete log computations carried out for multiple weak primes found in use in the wild. As can be expected from a trapdoor mechanism which we say is hard to detect, our research did not reveal any trapdoored prime in wide use. The only way for a user to defend against a hypothetical trapdoor of this kind is to require verifiably random primes

Potential benefit of intra-operative administration of ketorolac on breast cancer recurrence according to the patient's body mass index

Background: Nonsteroidal anti-inflammatory drugs (NSAIDs) are currently used in some countries as analgesics in primary cancer surgery. Retrospective studies suggest that NSAIDs could reduce breast cancer recurrences. Because NSAIDs also act on biological mechanisms present in patients with increased adiposity, we aimed at assessing whether the intra-operative administration of ketorolac or diclofenac would be associated with a reduction of recurrence in patients with elevated body mass index (BMI). Methods: We considered two institutional retrospective series of 827 and 1007 patients evaluating the administration of ketorolac (n = 529 with, n = 298 without) or diclofenac (n = 787 with, n = 220 without). The BMI subgroups were defined as less than 25 kg/m(2) (lean) and 25 or more kg/m(2) (overweight and obese). Cumulative incidence estimation of distant metastases as well as Fine-Gray and Dixon-Simon models was used. These analyses were adjusted for clinico-pathological variables. All statistical tests were two-sided. Results: The administration of ketorolac was statistically significantly associated with decreased incidence of distant recurrences (adjusted hazard ratio [aHR] = 0.59, 95% confidence interval [CI] = 0.37 to 0.96, P = .03). In particular, the association was evident in the high-body mass index (BMI) group of patients (aHR = 0.55, 95% CI = 0.31 to 0.96, P = .04). The administration of diclofenac was not statistically significantly associated with decreased incidence of distant recurrences, either in the global population or in the BMI subgroups. Conclusions: These results show that the intra-operative administration of ketorolac, but not diclofenac, is statistically significantly associated with a reduction of distant recurrences in patients with increased BMI. Altogether, this study points to a potentially important repositioning of ketorolac in the intra-operative treatment of patients with elevated BMI that, if prospectively validated, might be as impactful as and cheaper than adjuvant systemic anticancer therapies

Increased secretion of salivary glands produced by facial vibrotactile stimulation

Patients with low-back pain can be evaluated immediately by means of an electrical tool that produces bony vibration to the lumbar spinal processes (Yrjama M, Vanharanta H. Bony vibrotactile stimulation: A new, non-invasive method for examining intradiscal pain. European Spine Journal 1994;3:233–235). In the rehabilitation of masticatory disturbance and dysphagia, an electric toothbrush is commonly used as an oral motor exercise tool for the facilitation of blood flow and metabolism in the orofacial region in Japanese hospitals. However, subjects receiving vibration in the facial regions reported increased salivary secretion. We attempted to develop an oral motor exercise apparatus modified by a headphone headset that was fixed and could be used for extended periods. The vibration apparatus of the heating conductor is protected by the polyethyle methacrylate (dental mucosa protective material), and electric motors for vibration control of the PWM circuit. We examined the amount of salivation during vibration stimuli on the bilateral masseter muscle belly, using a cotton roll positioned at the opening of the secretory duct for 3 min. Although the quantity of salivation in each subject showed various and large fluctuations in the right and left sides of the parotid and submandibular and sublingual glands, one or more of the salivary glands were effectively stimulated by 89 Hz vibration. The reported apparatus will be useful as an additional method in orofacial rehabilitation